On Some Extensions to GA Package: Hybrid Optimisation, Parallelisation and Islands EvolutionOn some extensions to GA package: hybrid optimisation, parallelisation and islands evolution
نویسندگان
چکیده
منابع مشابه
On Some Extensions to GA Package: Hybrid Optimisation, Parallelisation and Islands Evolution
Abstract Genetic algorithms are stochastic iterative algorithms in which a population of individuals evolve by emulating the process of biological evolution and natural selection. The R package GA provides a collection of general purpose functions for optimisation using genetic algorithms. This paper describes some enhancements recently introduced in version 3 of the package. In particular, hyb...
متن کاملextensions of some polynomial inequalities to the polar derivative
توسیع تعدادی از نامساوی های چند جمله ای در مشتق قطبی
15 صفحه اولParallelisation of the multibody simulation package FEDEM
In this work we present some results from the EUROPORT project EUROPENGER{FEDEM. We give a brief presentation of the FEDEM code (Finite Element Dynamics in Elastic Mechanisms), which is a multidisciplinary, multibody simulation package for mechanical systems , and the preliminary results obtained in the parallelization of the system. We have emphasized the data distribution strategies and probl...
متن کاملZ extensions to the RHMAPPER package
MOTIVATION Extensions have been made to the RHMAPPER-1.1 package. One set of extensions computes the totally linked markers and uses the results as input to the salient RHMAPPER functions. The second set of extensions uses TKperl to provide an interactive interface for ease of querying the database and displaying maps. AVAILABILITY The extensions can be obtained via ftp.sanger.ac.uk/pub/zmapp...
متن کاملSimple Optimisation, through Parallelisation and Other Methods, of Temporal Networks
Ensuring suitable temporal flow for a given sequence of events is essential for many applications. One method of describing permitted flow is use of an ‘interval Allen’ network; essentially a temporal constraint graph. While Pinhanez provides algorithms that create such graphs, these operate in O(N) time, with respect to the number of nodes that the graph contains. This paper outlines a method ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The R Journal
سال: 2017
ISSN: 2073-4859
DOI: 10.32614/rj-2017-008